Evolutionary graph theory: breaking the symmetry between interaction and replacement.
نویسندگان
چکیده
We study evolutionary dynamics in a population whose structure is given by two graphs: the interaction graph determines who plays with whom in an evolutionary game; the replacement graph specifies the geometry of evolutionary competition and updating. First, we calculate the fixation probabilities of frequency dependent selection between two strategies or phenotypes. We consider three different update mechanisms: birth-death, death-birth and imitation. Then, as a particular example, we explore the evolution of cooperation. Suppose the interaction graph is a regular graph of degree h, the replacement graph is a regular graph of degree g and the overlap between the two graphs is a regular graph of degree l. We show that cooperation is favored by natural selection if b/c>hg/l. Here, b and c denote the benefit and cost of the altruistic act. This result holds for death-birth updating, weak-selection and large population size. Note that the optimum population structure for cooperators is given by maximum overlap between the interaction and the replacement graph (g=h=l), which means that the two graphs are identical. We also prove that a modified replicator equation can describe how the expected values of the frequencies of an arbitrary number of strategies change on replacement and interaction graphs: the two graphs induce a transformation of the payoff matrix.
منابع مشابه
Breaking the symmetry between interaction and replacement in evolutionary dynamics on graphs.
We study the evolution of cooperation modeled as symmetric 2x2 games in a population whose structure is split into an interaction graph defining who plays with whom and a replacement graph specifying evolutionary competition. We find it is always harder for cooperators to evolve whenever the two graphs do not coincide. In the thermodynamic limit, the dynamics on both graphs is given by a replic...
متن کاملInvestigation of Game Between Cells in Occurrence of Genetic Mutations Using Evolutionary Game Theory
In this paper, two games that play a role in creating a cancer tumor and suppression are studied using evolutionary game theory and its different modes are analyzed. The first game is the competition between a cancer cell and a healthy cell to receive food through the blood. In the second game, the interaction between the two oncogenes Ras and Myc is examined for cellular deformation
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملنظریه میدان ناجابهجایی و پارامترهای نقض لورنتس در QED
Non-commutative field theory as a theory including the Lorentz violation can be constructed in two different ways. In the first method, the non-commutative fields are the same as the ordinary ones while the gauge group is restricted to U(n). For example, the symmetry group of standard model in non-commutative space is U(3)×(2)×U(1) which can be reduced to SU(3)×SU(2)×U(1) by two appropriate spo...
متن کاملBreaking Symmetries in Graph Representation
There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution. In this paper we introduce novel, effective and compact, symmetry breaking constraints for undirected graph search. While incomplete, these prove ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of theoretical biology
دوره 246 4 شماره
صفحات -
تاریخ انتشار 2007